On the spectral moment of graphs with given clique number
نویسندگان
چکیده
منابع مشابه
On the Spectral Moment of Graphs with given Clique Number
Let Ln,t be the set of all n-vertex connected graphs with clique number t (2 ≤ t ≤ n). For nvertex connected graphs with given clique number, lexicographic ordering by spectral moments (S-order) is discussed in this paper. The first ∑⌊(n−t−1)/3⌋ i=1 (n − t − 3i) + 1 graphs with 3 ≤ t ≤ n − 4, and the last few graphs, in the Sorder, among Ln,t are characterized. In addition, all graphs in Ln,n ∪...
متن کاملThe minimum spectral radius of graphs with a given clique number
In this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn−ω,ω , which consists of a complete graph Kω to a vertex of which a path Pn−ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω , m ≥ 1, belong is exhibited.
متن کاملThe smallest Laplacian spectral radius of graphs with a given clique number
Article history: Received 23 September 2011 Accepted 30 March 2012 Available online 4 May 2012 Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملEla the Minimum Spectral Radius of Graphs with a given Clique Number∗
In this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn−ω,ω , which consists of a complete graph Kω to a vertex of which a path Pn−ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω , m ≥ 1, belong is exhibited.
متن کاملThe Smallest Spectral Radius of Graphs with a Given Clique Number
The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2016
ISSN: 0035-7596
DOI: 10.1216/rmj-2016-46-1-261